Divisors on graphs, orientations, syzygies, and system reliability
نویسندگان
چکیده
منابع مشابه
Divisors on graphs, Connected flags, and Syzygies
We study the binomial and monomial ideals arising from linear equivalence of divisors on graphs from the point of view of Gröbner theory. We give an explicit description of a minimal Gröbner basis for each higher syzygy module. In each case the given minimal Gröbner basis is also a minimal generating set. The Betti numbers of IG and its initial ideal (with respect to a natural term order) coinc...
متن کاملGraphs, Syzygies, and Multivariate Splines
The module of splines on a polyhedral complex can be viewed as the syzygy module of its dual graph with edges weighted by powers of linear forms. When the assignment of linear forms to edges meets certain conditions, we can decompose the graph into disjoint cycles without changing the isomorphism class of the syzygy module. Thus we can use this decomposition to compute the homological dimension...
متن کاملGraphs and Zero-divisors
In an algebra class, one uses the zero-factor property to solve polynomial equations. For example, consider the equation x 2 = x. Rewriting it as x (x − 1) = 0, we conclude that the solutions are x = 0, 1. However, the same equation in a different number system need not yield the same solutions. For example, in Z 6 (the integers modulo 6), not only 0 and 1, but also 3 and 4 are solutions. (Chec...
متن کاملInvolutions on Standard Young Tableaux and Divisors on Metric Graphs
We elaborate upon a bijection discovered by Cools, Draisma, Payne, and Robeva in [CDPR12] between the set of rectangular standard Young tableaux and the set of equivalence classes of chip configurations on certain metric graphs under the relation of linear equivalence. We present an explicit formula for computing the v0-reduced divisors (representatives of the equivalence classes) associated to...
متن کاملColorings and orientations of graphs
Bounds for the chromatic number and for some related parameters of a graph are obtained by applying algebraic techniques. In particular, the following result is proved: If G is a directed graph with maximum outdegree d, and if the number of Eulerian subgraphs of G with an even number of edges differs from the number of Eulerian subgraphs with an odd number of edges then for any assignment of a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2015
ISSN: 0925-9899,1572-9192
DOI: 10.1007/s10801-015-0641-y